Ellipsoid method - PDFSEARCH.IO - Document Search Engine

Ellipsoid method
Results: 62

#	Item
11	CS261: Exercise Set #4 For the week of January 25–29, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-01 16:25:33 Linear programming Convex optimization Operations research Mathematical optimization Combinatorial optimization Duality Weak duality Ellipsoid method Semidefinite programming
12	HVX: Disciplined Convex Programming and Symbolic Subdifferentiation in Haskell Chris Copeland 1 Add to Reading List Source URL: www.scs.stanford.edu Language: English - Date: 2014-06-12 03:57:46 Convex analysis Mathematical optimization Convex optimization Operations research Variational analysis Subgradient method Subderivative Ellipsoid method Convex function Generalized algebraic data type Convex set Map
13	CS261: A Second Course in Algorithms Lecture #10: The Minimax Theorem and Algorithms for Linear Programming∗ Tim Roughgarden† February 4, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-14 14:14:35 Operations research Linear programming Convex optimization Combinatorial optimization Mathematical optimization Simplex algorithm Ellipsoid method Simplex Candidate solution Nonlinear programming Minimax Optimization problem
14	CS364B: Frontiers in Mechanism Design Lecture #6: Gross Substitutes: Welfare Maximization in Polynomial Time∗ Tim Roughgarden† January 22, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-04 12:04:28 Convex optimization Linear programming Operations research Mathematical optimization Combinatorial optimization Competitive equilibrium Duality Interior point method Ellipsoid method Weak duality VickreyClarkeGroves auction Polynomial
15	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2011-10-07 01:19:59 Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method Mathematical optimization Mechanism design
16	Index affine-scaling method, 202–204, 206, 210 poor performance of, 203 steplength choice, 203 approximation problems, 218–227 1 -norm, 221–224 Add to Reading List Source URL: www.siam.org Language: English - Date: 2007-12-06 14:06:58 Mathematical optimization Operations research Linear programming Convex optimization Interior point method Simplex algorithm Nonlinear programming Quadratic programming Duality Revised simplex method Ellipsoid method Linear complementarity problem
17	51 Documenta Math. Linear Programming Stories Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-25 10:24:41 Operations research Convex optimization Lattice points Combinatorial optimization Computational number theory Ellipsoid method Linear programming Leonid Khachiyan Lattice reduction LenstraLenstraLovsz lattice basis reduction algorithm Mathematical optimization Arjen Lenstra
18	Computing an Extensive-Form Correlated Equilibrium in Polynomial Time Wan Huang and Bernhard von Stengel Department of Mathematics, London School of Economics, London WC2A 2AE, United Kingdom , stengel Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2008-10-25 17:36:10 Mathematics Convex optimization Operations research Academia Applied mathematics Game theory Extensive-form game Nash equilibrium Normal-form game Ellipsoid method Linear programming Polynomial
19	A Mini-Course on Convex Optimization with a view toward designing fast algorithms Nisheeth K. Vishnoi i Add to Reading List Source URL: theory.epfl.ch Language: English - Date: 2015-10-07 04:19:12 Mathematical optimization Mathematical analysis Numerical analysis Convex analysis Convex optimization Operations research Linear programming Convex function Gradient descent Derivative Convex set Ellipsoid method
20	4164 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 7, JULY 2012 Interior-Point Methods for Full-Information and Bandit Online Learning Add to Reading List Source URL: www-stat.wharton.upenn.edu Language: English - Date: 2013-03-18 20:18:38 Mathematical optimization Convex analysis Operations research Convex optimization Machine learning Self-concordant function Interior point method Ellipsoid method Linear programming Algorithm Convex set Stability